Almost sure convergence of continuous time branching processes

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Almost sure convergence of the Bartlett estimator

We study the almost sure convergence of the Bartlett estimator for the asymptotic variance of the sample mean of a stationary weekly dependent process. We also study the a. s. behavior of this estimator in the case of long-range dependent observations. In the weakly dependent case, we establish conditions under which the estimator is strongly consistent. We also show that, after appropriate nor...

متن کامل

Jakimovski Methods and Almost-Sure Convergence

The classical summability methods of Borel (B) and Euler (E(λ), λ > 0) play an important role in many areas of mathematics. For instance, in summability theory they are perhaps the most important methods other than the Cesàro (Cα) and Abel (A) methods, and two chapters of the classic book of Hardy (1949) are devoted to them. In probability, the distinction between methods of Cesàro-Abel and Eul...

متن کامل

Almost sure convergence, convergence in probability and asymptotic normality

In the previous chapter we considered estimator of several different parameters. The hope is that as the sample size increases the estimator should get ‘closer’ to the parameter of interest. When we say closer we mean to converge. In the classical sense the sequence {xk} converges to x (xk → x), if |xk − x| → 0 as k → ∞ (or for every ε > 0, there exists an n where for all k > n, |xk − x| < ε). ...

متن کامل

A strong law of large numbers for branching processes: almost sure spine events

We demonstrate a novel strong law of large numbers for branching processes, with a simple proof via measure-theoretic manipulations and spine theory. Roughly speaking, any sequence of events that eventually occurs almost surely for the spine entails the almost sure convergence of a certain sum over particles in the population.

متن کامل

Almost Sure Bisimulation in Labelled Markov Processes

In this paper we propose a notion of bisimulation for labelled Markov processes parameterised by negligible sets (LMPns). The point is to allow us to say things like two LMPs are “almost surely” bisimilar when they are bisimilar everywhere except on a negligible set. Usually negligible sets are sets of measure 0, but we work with abstract ideals of negligible sets and so do not introduce an ad-...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Stochastic Processes and their Applications

سال: 1978

ISSN: 0304-4149

DOI: 10.1016/0304-4149(78)90028-5